On Khot’s Unique Games Conjecture
نویسنده
چکیده
In 2002, Subhash Khot formulated the Unique Games Conjecture, a conjecture about the computational complexity of certain optimization problems. The conjecture has inspired a remarkable body of work, which has clarified the computational complexity of several optimization problems and the effectiveness of “semidefinite programming” convex relaxations. In this paper, which assumes no prior knowledge of computational complexity, we describe the context and statement of the conjecture, and we discuss in some detail one specific line of work motivated by it.
منابع مشابه
Near-Optimal UGC-hardness of Approximating Max k-CSP_R
In this paper, we prove an almost-optimal hardness for Max k-CSPR based on Khot’s Unique Games Conjecture (UGC). In Max k-CSPR, we are given a set of predicates each of which depends on exactly k variables. Each variable can take any value from 1, 2, . . . , R. The goal is to find an assignment to variables that maximizes the number of satisfied predicates. Assuming the Unique Games Conjecture,...
متن کاملOn the Complexity of Unique Games and Graph Expansion
Understanding the complexity of approximating basic optimization problems is one of the grand challenges of theoretical computer science. In recent years, a sequence of works established that Khot’s Unique Games Conjecture, if true, would settle the approximability of many of these problems, making this conjecture a central open question of the field. The results of this thesis shed new light o...
متن کاملApproximation Algorithms for Unique Games ∗ Luca Trevisan
A unique game is a type of constraint satisfaction problem with two variables per constraint. The value of a unique game is the fraction of the constraints satisfied by an optimal solution. Khot (STOC’02) conjectured that for arbitrarily small γ,ε > 0 it is NPhard to distinguish games of value smaller than γ from games of value larger than 1− ε . Several recent inapproximability results rely on...
متن کاملThe Unique Games Conjecture and Some of Its Implications on Inapproximability
In this report, we study the Unique Games conjecture of Khot [32] and its implications on the hardness of approximating some important optimization problems. The conjecture states that it is NP-hard to determine whether the value of a unique 1-round game between two provers and a verifier is close to 1 or negligible. It gives rise to PCP systems where the verifier needs to query only 2 bits fro...
متن کاملA Characterization of Approximation Resistance
A predicate f : {−1, 1} → {0, 1} with ρ(f) = |f −1(1)| 2k is called approximation resistant if given a near-satisfiable instance of CSP(f), it is computationally hard to find an assignment that satisfies at least ρ(f) + Ω(1) fraction of the constraints. We present a complete characterization of approximation resistant predicates under the Unique Games Conjecture. We also present characterizatio...
متن کامل